Dynamics of confident voting
نویسندگان
چکیده
We introduce the confident voter model, in which each voter can be in one of two opinions and can additionally have two levels of commitment to an opinion—confident and unsure. Upon interacting with an agent of a different opinion, a confident voter becomes less committed, or unsure, but does not change opinion. However, an unsure agent changes opinion by interacting with an agent of a different opinion. In the mean-field limit, a population of size N is quickly driven to a mixed state and remains close to this state before consensus is eventually achieved in a time of the order of lnN . In two dimensions, the distribution of consensus times is characterized by two distinct times—one that scales linearly with N and another that appears to scale as N3/2. The longer time arises from configurations that fall into long-lived states that consist of two (or more) single-opinion stripes before consensus is reached. These stripe states arise from an effective surface tension between domains of different opinions.
منابع مشابه
A Confident Majority Voting Strategy for Parallel and Modular Support Vector Machines
Support vector machines (SVMs) has been accepted as a fashionable method in machine learning community, but it cannot be easily scaled to handle large scale problems for its time and space complexity that is around quadratic in the number of training samples. In this paper, confident majority voting (CMV) is proposed to scale SVMs (CMV-SVMs). CMV-SVMs decomposes a large-scale task into many sma...
متن کاملTesting Voters' Understanding of a Security Mechanism Used in Verifiable Voting
Proposals for a secure voting technology can involve new mechanisms or procedures designed to provide greater ballot secrecy or verifiability. These mechanisms may be justified on the technical level, but researchers and voting officials must also consider how voters will understand these technical details, and how understanding may affect interaction with the voting systems. In the context of ...
متن کاملReputational Dynamics and Political Careers
I study a model of repeated elections with both symmetric learning about candidate ability and moral hazard. In this model, candidates choose how to allocate their resources between constituency service and policy work. Early in their careers, they devote excessive time to constituency service in an attempt to manipulate voter learning. Since voters use elections to select better candidates, in...
متن کاملDouble voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کامل